On multiplication in finite fields
نویسندگان
چکیده
منابع مشابه
Private Multiplication over Finite Fields
The notion of privacy in the probing model, introduced by Ishai, Sahai, and Wagner in 2003, is nowadays frequently involved to assess the security of circuits manipulating sensitive information. However, provable security in this model still comes at the cost of a significant overhead both in terms of arithmetic complexity and randomness complexity. In this paper, we deal with this issue for ci...
متن کاملFast Multiplication in Finite Fields GF(2)
A method is described for performing computations in a finite field GF(2 ) by embedding it in a larger ring Rp where the multiplication operation is a convolution product and the squaring operation is a rearrangement of bits. Multiplication in Rp has complexity N +1, which is approximately twice as efficient as optimal normal basis multiplication (ONB) or Montgomery multiplication in GF(2 ), wh...
متن کاملOn the Bilinear Complexity of the Multiplication in Finite Fields
— The aim of this paper is to introduce the bilinear complexity of the multiplication in finite fields and to give a brief exposition of the recent results obtained in this part of algebraic complexity theory. In particular we present the new results obtained using the Chudnovsky-Chudnovsky algorithm and its generalizations. Résumé (Sur la complexité bilinéaire de la multiplication dans les cor...
متن کاملMultiplication of Polynomials over Finite Fields
We prove the 2.5n − o (n ) lower bound on the number of multiplications/divisions required to compute the coefficients of the product of two polynomials of degree n over a finite field by means of straight-line algorithms.
متن کاملMultiplication in Cyclotomic Rings and its Application to Finite Fields
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in cyclotomic rings and cyclotomic fields in that most arithmetic operations are done on vectors. From this formulation we can generate optimized algorithms for m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2010
ISSN: 0885-064X
DOI: 10.1016/j.jco.2009.11.002